On Topological Completeness of Regular Tree Languages
نویسندگان
چکیده
We identify the class of Σ1–inductive sets studied by Moschovakis as a set theoretical generalization of the class (1, 3) of the Rabin-Mostowski index hierarchy of alternating automata on infinite trees. That is, we show that every tree language recognized by an alternating automaton of index (1, 3) is Σ1–inductive, and exhibit an automaton whose language is complete in this class w.r.t. continuous reductions. Classification. F.1.1 Models of Computation,F.4.1 Mathematical Logic,F.4.3 Formal Languages.
منابع مشابه
TOPOLOGICAL CHARACTERIZATION FOR FUZZY REGULAR LANGUAGES
We present a topological characterization for fuzzy regular languages: we show that there is a bijective correspondence between fuzzy regular languages and the set of all clopen fuzzy subsets with finite image in the induced fuzzy topological space of Stone space (Profinite space), and then we give a representation of closed fuzzy subsets in the induced fuzzy topological space via fuzzy regular...
متن کاملMultidimensional fuzzy finite tree automata
This paper introduces the notion of multidimensional fuzzy finite tree automata (MFFTA) and investigates its closure properties from the area of automata and language theory. MFFTA are a superclass of fuzzy tree automata whose behavior is generalized to adapt to multidimensional fuzzy sets. An MFFTA recognizes a multidimensional fuzzy tree language which is a regular tree language so that for e...
متن کاملAlternating Regular Tree Grammars in the Framework of Lattice-Valued Logic
In this paper, two different ways of introducing alternation for lattice-valued (referred to as {L}valued) regular tree grammars and {L}valued top-down tree automata are compared. One is the way which defines the alternating regular tree grammar, i.e., alternation is governed by the non-terminals of the grammar and the other is the way which combines state with alternation. The first way is ta...
متن کاملA Topological Study of Phrase-Structure Languages
It is proposed that structural equivalence of phrase-structure languages be defined by means of introducing, for each such language, a class of topological structures on the language. More specifically, given a phrase-structure language (either as a set of trees or as a set of strings), we introduce a class of topological spaces associated with finite sets of "phrases." A function from one lang...
متن کاملFractal Completeness Techniques in Topological Modal Logic: Koch Curve, Limit Tree, and the Real Line
This paper explores the connection between fractal geometry and topological modal logic. In the early 1940’s, Tarski showed that the modal logic S4 can be interpreted in topological spaces. Since then, many interesting completeness results in the topological semantics have come to light, and renewed interest in this semantics can be seen in such recent papers as [1], [2], [3], [4], and [7]. In ...
متن کامل